ABC135 B - 0 or 1 Swap

提出

code: python

import copy

n = int(input())

p = list(map(int, input().split()))

p2 = copy.copy(p)

p2.sort()

diff = 0

for i in range(n):

diff += 1

if (diff > 2):

print("NO")

else:

print("YES")